45,092 research outputs found

    Bottom-trapped currents as statistical equilibrium states above topographic anomalies

    Get PDF
    Oceanic geostrophic turbulence is mostly forced at the surface, yet strong bottom-trapped flows are commonly observed along topographic anomalies. Here we consider the case of a freely evolving, initially surface-intensified velocity field above a topographic bump, and show that the self-organization into a bottom-trapped current can result from its turbulent dynamics. Using equilibrium statistical mechanics, we explain this phenomenon as the most probable outcome of turbulent stirring. We compute explicitly a class of solutions characterized by a linear relation between potential vorticity and streamfunction, and predict when the bottom intensification is expected. Using direct numerical simulations, we provide an illustration of this phenomenon that agrees qualitatively with theory, although the ergodicity hypothesis is not strictly fulfilled

    Microfluidic method for rapid turbidimetric detection of the DNA of Mycobacterium tuberculosis using loop-mediated isothermal amplification in capillary tubes

    Get PDF
    We describe a microfluidic method for rapid isothermal turbidimetric detection of the DNA of Mycobacterium tuberculosis. Loop-mediated isothermal amplification is accomplished in capillary tubes for amplifying DNA in less than 15 min, and sensitivity and specificity were compared to conventional loop-mediated isothermal amplification (LAMP). The method can detect as little as 1 pg mL−1 DNA in a sample. Results obtained with clinical specimens indicated 90 % sensitivity and 95 % specificity for microfluidic LAMP in comparison to culture methods. No interference occurred due to the presence of nonspecific DNAs. The findings demonstrate the power of the new microfluidic LAMP test for rapid molecular detection of microorganisms even when using bare eyes. © 2014, Springer-Verlag Wien

    Low Cost Quality of Service Multicast Routing in High Speed Networks

    Get PDF
    Many of the services envisaged for high speed networks, such as B-ISDN/ATM, will support real-time applications with large numbers of users. Examples of these types of application range from those used by closed groups, such as private video meetings or conferences, where all participants must be known to the sender, to applications used by open groups, such as video lectures, where partcipants need not be known by the sender. These types of application will require high volumes of network resources in addition to the real-time delay constraints on data delivery. For these reasons, several multicast routing heuristics have been proposed to support both interactive and distribution multimedia services, in high speed networks. The objective of such heuristics is to minimise the multicast tree cost while maintaining a real-time bound on delay. Previous evaluation work has compared the relative average performance of some of these heuristics and concludes that they are generally efficient, although some perform better for small multicast groups and others perform better for larger groups. Firstly, we present a detailed analysis and evaluation of some of these heuristics which illustrates that in some situations their average performance is reversed; a heuristic that in general produces efficient solutions for small multicasts may sometimes produce a more efficient solution for a particular large multicast, in a specific network. Also, in a limited number of cases using Dijkstra's algorithm produces the best result. We conclude that the efficiency of a heuristic solution depends on the topology of both the network and the multicast, and that it is difficult to predict. Because of this unpredictability we propose the integration of two heuristics with Dijkstra's shortest path tree algorithm to produce a hybrid that consistently generates efficient multicast solutions for all possible multicast groups in any network. These heuristics are based on Dijkstra's algorithm which maintains acceptable time complexity for the hybrid, and they rarely produce inefficient solutions for the same network/multicast. The resulting performance attained is generally good and in the rare worst cases is that of the shortest path tree. The performance of our hybrid is supported by our evaluation results. Secondly, we examine the stability of multicast trees where multicast group membership is dynamic. We conclude that, in general, the more efficient the solution of a heuristic is, the less stable the multicast tree will be as multicast group membership changes. For this reason, while the hybrid solution we propose might be suitable for use with closed user group multicasts, which are likely to be stable, we need a different approach for open user group multicasting, where group membership may be highly volatile. We propose an extension to an existing heuristic that ensures multicast tree stability where multicast group membership is dynamic. Although this extension decreases the efficiency of the heuristics solutions, its performance is significantly better than that of the worst case, a shortest path tree. Finally, we consider how we might apply the hybrid and the extended heuristic in current and future multicast routing protocols for the Internet and for ATM Networks.

    Bell's inequality and the coincidence-time loophole

    Get PDF
    This paper analyzes effects of time-dependence in the Bell inequality. A generalized inequality is derived for the case when coincidence and non-coincidence [and hence whether or not a pair contributes to the actual data] is controlled by timing that depends on the detector settings. Needless to say, this inequality is violated by quantum mechanics and could be violated by experimental data provided that the loss of measurement pairs through failure of coincidence is small enough, but the quantitative bound is more restrictive in this case than in the previously analyzed "efficiency loophole."Comment: revtex4, 3 figures, v2: epl document class, reformatted w slight change

    A knowledge based software engineering environment testbed

    Get PDF
    The Carnegie Group Incorporated and Boeing Computer Services Company are developing a testbed which will provide a framework for integrating conventional software engineering tools with Artifical Intelligence (AI) tools to promote automation and productivity. The emphasis is on the transfer of AI technology to the software development process. Experiments relate to AI issues such as scaling up, inference, and knowledge representation. In its first year, the project has created a model of software development by representing software activities; developed a module representation formalism to specify the behavior and structure of software objects; integrated the model with the formalism to identify shared representation and inheritance mechanisms; demonstrated object programming by writing procedures and applying them to software objects; used data-directed and goal-directed reasoning to, respectively, infer the cause of bugs and evaluate the appropriateness of a configuration; and demonstrated knowledge-based graphics. Future plans include introduction of knowledge-based systems for rapid prototyping or rescheduling; natural language interfaces; blackboard architecture; and distributed processin

    UML Deficiencies from the perspective of Automatic Performance Model Generation

    Get PDF
    A discussion surrounding the use of UML for distributed system design

    Nanomolecular detection of human influenza virus type A using reverse transcription loop-mediated isothermal amplification assisted with rod-shaped gold nanoparticles

    Get PDF
    Reverse transcription loop-mediated isothermal amplification (RT-LAMP) and rod-shaped gold nanoparticles (gold nanorods; GNRs) were employed for nanomolecular detection of human influenza virus type A RNA. After cDNA synthesis from the RNA, the primers targeting the M protein gene were used for LAMP amplification. A blue shift from red to purple from the GNR inserting into the LAMP-DNAs can be seen by the naked eye. Transmission electron microscopy revealed the formation GNR aggregates due to their interactions with LAMP DNA. One pg RNA (10-3 dilution of the viral cDNA) was detected using this colorimetric test. The nanomolecular test showed 100% sensitivity and 95.8% specificity in comparison to results by RT-PCR. Also, the test indicated 100% sensitivity and 100% specificity in comparison to results by RT-LAMP. The described nanomolecular test could detect human influenza virus type A RNA in nearly 1 hour. This journal is © the Partner Organisations 2014
    • 

    corecore